Acceleration of sequential subspace optimization in Banach spaces by orthogonal search directions
نویسندگان
چکیده
منابع مشابه
Remarks on Orthogonal Convexity of Banach Spaces
It is proved that orthogonal convexity defined by A. JimenezMelado and E. Llorens-F'uster implies the weak Banach-Saks property. Relations between orthogonal convexity and another geometric properties, such as nearly uniform smoothness and property ( P ) , are studied. Introduction. Orthogonal convexity has been introduced by A. Jimenez-Melado and E. Llorens-F'uster (see [3] and [4]) as a geome...
متن کاملOptimization Methods in Banach Spaces
In this chapter we present a selection of important algorithms for optimization problems with partial differential equations. The development and analysis of these methods is carried out in a Banach space setting. We begin by introducing a general framework for achieving global convergence. Then, several variants of generalized Newton methods are derived and analyzed. In particular, necessary a...
متن کاملConvex Optimization on Banach Spaces
Greedy algorithms which use only function evaluations are applied to convex optimization in a general Banach space X . Along with algorithms that use exact evaluations, algorithms with approximate evaluations are treated. A priori upper bounds for the convergence rate of the proposed algorithms are given. These bounds depend on the smoothness of the objective function and the sparsity or compre...
متن کاملSubspace structure of some operator and Banach spaces
We construct a family of separable Hilbertian operator spaces, such that the relation of complete isomorphism between the subspaces of each member of this family is complete Kσ . We also investigate some interesting properties of completely unconditional bases of the spaces from this family. In the Banach space setting, we construct a space for which the relation of isometry of subspaces is equ...
متن کاملSpeeding-Up Convergence via Sequential Subspace Optimization: Current State and Future Directions
This is an overview paper written in style of research proposal. In recent years we introduced a general framework for large-scale unconstrained optimization – Sequential Subspace Optimization (SESOP) and demonstrated its usefulness for sparsity-based signal/image denoising, deconvolution, compressive sensing, computed tomography, diffraction imaging, support vector machines. We explored its co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2019
ISSN: 0377-0427
DOI: 10.1016/j.cam.2018.05.049